Spacecraft Attitude Control under Constrained Zones via Quadratically Constrained Quadratic Programming
نویسندگان
چکیده
This paper examines an optimal spacecraft attitude control problem in the presence of complicated attitude forbidden and mandatary zones. The objective is to design an optimal reorientation trajectory for a rigid body spacecraft under constraints, which is originally formulated as a nonlinear programming problem. The attitude forbidden zones are considered to prevent the light-sensitive instruments operated on-board from exposure to bright light while the mandatory zones are to keep the communication instrument in certain zones to transmit and receive signals. When unit quaternions are used to represent the attitude of spacecraft, the dynamics and constraints are formulated as quadratic functions. By discretizing the reorientation trajectory into discrete nodes, the optimal attitude control problem can be formulated as general quadratically constrained quadratic programming (QCQP). An iterative rank minimization approach is proposed to gradually approach to the optimal solution of nonconvex QCQP. Simulation results are presented to demonstrate the feasibility of proposed algorithm.
منابع مشابه
Aas 13-836 Quaternion Based Optimal Spacecraft Reorientation under Complex Attitude Constrained Zones
The paper addresses quaternion-based energy and time optimal spacecraft reorientation in the presence of complex attitude constrained zones. Designing an optimal reorientation trajectory for a rigid body spacecraft is posed as a nonlinear optimal control problem. In this direction, attitude constrained zones are defined with respect to the onboard instrument under two categories, forbidden and ...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملPath Planning of Spatial Rigid Motion with Constrained Attitude
This paper presents a general quadratic optimization methodology for autonomous path planning of spatial rigid motion with constrained attitude. The motion to be planned has six degrees of freedom and is assumed under constant velocity in the body frame. The objective is to determine the motion orientation (or attitude), handled as control variables, along the planned paths. A procedure is disc...
متن کاملInexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
We propose and analyze a perturbed version of the classical Josephy– Newton method for solving generalized equations. This perturbed framework is convenient to treat in a unified way standard sequential quadratic programming, its stabilized version, sequential quadratically constrained quadratic programming, and linearly constrained Lagrangian methods. For the linearly constrained Lagrangian me...
متن کاملInexact Josephy–newton Framework for Genereralized Equations and Its Applications to Local Analysis of Newtonian Methods for Constrained Optimization∗
We propose and analyze a perturbed version of the classical Josephy-Newton method for solving generalized equations. This perturbed framework is convenient to treat in a unified way standard sequential quadratic programming, its stabilzed version, sequential quadratically constrained quadratic programming, and linearly constrained Lagrangian methods. For the linearly constrained Lagrangian meth...
متن کامل